例句與造句

1. The lazy evaluation feature is needed to handle recursive data structures like trees and graphs
   懶惰求值的特性常用在處理像tree或者graph這樣的遞歸數(shù)據(jù)結(jié)構(gòu)上。
2. From there , you can use all the higher order techniques haskell provides for dealing with recursive data structures
   從那里，可以使用haskell提供的所有高階技術(shù)來處理遞歸數(shù)據(jù)結(jié)構(gòu)。
3. The library haxml creates representations of xml documents as native recursive data structures in the functional language haskell
   庫haxml中將xml文檔的表示創(chuàng)建成函數(shù)性語言haskell中原始的遞歸數(shù)據(jù)結(jié)構(gòu)。
4. It's difficult to find recursive data structure in a sentence. 用recursive data structure造句挺難的